Appendix to “Iterated Ultrapowers for the Masses”
نویسندگان
چکیده
This document provides solutions to the exercises in “Iterated Ultrapowers for the Masses”. 3.3. Exercise. Let U be anM-amenable ultrafilter on the parametricallyM-definable subsets of M . We begin by showing that U2 is a filter on the parametricallyM-definable subsets of M2. Let X,Y ⊆M2 be parametrically M-definable. Let Z = {m ∈M : (X ∩ Y )|m ∈ U}, Z1 = {m ∈M : X|m ∈ U}, Z2 = {m ∈M : Y |m ∈ U}. Since U is M-amenable, Z, Z1 and Z2 are parametrically M-definable subsets of M . Now, Z = {m ∈M : X|m ∩ Y |m ∈ U}. And, since U is a filter, X|m ∩ Y |m ∈ U if and only if X|m ∈ U and Y |m ∈ U . Therefore, using the fact that U is a filter, X ∩ Y ∈ U ⇐⇒ Z ∈ U ⇐⇒ Z1 ∩ Z2 ∈ U ⇐⇒ Z1 ∈ U and Z2 ∈ U ⇐⇒ X ∈ U and Y ∈ U. It follows that if X,Y ∈ U2, then X ∩ Y ∈ U2; and if X ∈ U2 and X ⊆ Y , then Y ∈ U2. Therefore U2 is a filter. We are left to verify that U2 is an ultrafilter. Let X and Z1 be as above. Let W = {m ∈M : (M\X)|m ∈ U}. Again, since U is M-amenable, W is a parametrically M-definable subset of M . Note that W = {m ∈M : M\(X|m) ∈ U}. And, since U is an ultrafilter, for all m ∈M , M\(X|m) ∈ U if and only if X|m / ∈ U . Therefore W = {m ∈M : X|m / ∈ U} = M\Z1.
منابع مشابه
Boolean Ultrapowers, the Bukovský-dehornoy Phenomenon, and Iterated Ultrapowers
We show that while the length ω iterated ultrapower by a normal ultrafilter is a Boolean ultrapower by the Boolean algebra of Př́ıkrý forcing, it is consistent that no iteration of length greater than ω (of the same ultrafilter and its images) is a Boolean ultrapower. For longer iterations, where different ultrafilters are used, this is possible, though, and we give Magidor forcing and a general...
متن کاملSome Applications of ~terated Ultrapowers in Set Theory
Let 91 be a ~-complete ultrafilter on the measurable cardinal ~. Scott [ 1 3 ] proved V ¢ L by using 91 to take the ultrapower of V. Gaifman [ 2] considered iterated ultrapowers of V by cg to conclude even stronger results; for example, that L n ~(6o) is count-able. In this paper we discuss some new applications of iterated ultra-powers. In § § 1-4, we develop a straightforward generalization o...
متن کاملRepresentation of MV-algebras by regular ultrapowers of [0, 1]
We present a uniform version of Di Nola Theorem, this enables to embed all MV-algebras of a bounded cardinality in an algebra of functions with values in a single non-standard ultrapower of the real interval [0, 1]. This result also implies the existence, for any cardinal α, of a single MValgebra in which all infinite MV-algebras of cardinality at most α embed. Recasting the above construction ...
متن کاملRelative set theory: Internal view
A nonstandard set theory with many levels of standardness was first proposed by Yves Péraire [28]. The theory GRIST formulated here is an extension of Péraire’s RIST. We prove that it is conservative and categorical over ZFC, and universal among theories of its kind. Technically, the paper carries out detailed analysis of the construction of internally iterated ultrapowers introduced in the aut...
متن کاملIterated Local Reeection Vs Iterated Consistency
For \natural enough" systems of ordinal notation we show that times iterated local reeection schema over a suuciently strong arithmetic T proves the same 0 1-sentences as ! times iterated consistency. A corollary is that the two hierarchies catch up modulo relative interpretability exactly at-numbers. We also derive the following more general \mixed" formulas estimating the consistency strength...
متن کامل